Embedding Graphs Having Ore-Degree at Most Five
نویسندگان
چکیده
منابع مشابه
Ordinary abelian varieties having small embedding degree
Miyaji, Nakabayashi and Takano (MNT) gave families of group orders of ordinary elliptic curves with embedding degree suitable for pairing applications. In this paper we generalise their results by giving families corresponding to non-prime group orders. We also consider the case of ordinary abelian varieties of dimension 2. We give families of group orders with embedding degrees 5, 10 and 12.
متن کاملInduced matchings in graphs of degree at most 4
We show that if G is a connected graph of maximum degree at most 4, which is not C2,5, then the strong matching number of G is at least 1 9n(G). This bound is tight and the proof implies a polynomial time algorithm to find an induced matching of this size.
متن کاملLight subgraphs in graphs with average degree at most four
A graph H is said to be light in a family G of graphs if at least one member of G contains a copy of H and there exists an integer λ(H,G) such that each member G of G with a copy of H also has a copy K of H such that degG(v) ≤ λ(H,G) for all v ∈ V(K). In this paper, we study the light graphs in the class of graphs with small average degree, including the plane graphs with some restrictions on g...
متن کاملDrawing Cubic Graphs with at Most Five Slopes
We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice.
متن کاملEmbedding Arbitrary Graphs of Maximum Degree Two
Let S(H) be the minimum degree of the graph H. We prove that a graph H of order n with S(H) ^ (2n —1)/3 contains any graph G of order at most n and maximum degree A(G) < 2 as a subgraph, and this bound is best possible. Furthermore, this result settles the case A(G) = 2 of the well-known conjecture of Bollobas, Catlin and Eldridge on packing two graphs with given maximum degree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2019
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1155442